Requirement-Based Cooperative Theorem Proving

نویسنده

  • Dirk Fuchs
چکیده

We examine an approach for demand-driven cooperative theorem proving. We brieey point out the problems arising from the use of common success-driven cooperation methods, and we propose the application of our approach of requirement-based cooperative theorem proving. This approach allows for a better orientation on current needs of provers in comparison with conventional cooperation concepts. We introduce an abstract framework for requirement-based cooperation and describe two instantiations of it: Requirement-based exchange of facts and sub-problem division and transfer via requests. Finally, we report on experimental studies conducted in the areas superposition and unfailing completion .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Cooperative Parallel Automated

Automated Theorem Proving can be interpreted as the solution of search problems which comprise huge search spaces. Parallelization of the proof task as well as cooperation between the involved provers ooer the possibility to develop more eecient search procedures. In this paper we want to investigate concepts for the development of cooperative parallel theorem provers. We deal with architectura...

متن کامل

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (...

متن کامل

Coupling Saturation-Based Provers by Exchanging Positive/Negative Information

We examine diierent possibilities of coupling saturation-based theorem pro-vers by exchanging positive/negative information. We discuss which positive or negative information is well-suited for cooperative theorem proving and show in an abstract way how this information can be used. Based on this study, we introduce a basic model for cooperative theorem proving. We present theoretical results r...

متن کامل

Automated Theorem Proving for Quality-checking Medical Guidelines

Requirements about the quality of medical guidelines can be represented using schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-oriented aspects expressed in a guideline. Previously we have shown that these requirements can be verified using interactive theorem proving techniques [HLB04]. In this paper, we investigate how this approach can be mappe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998